- sub-set problem
- задача об укладке ранца (рюкзака)
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
sub-set problem
Смотреть что такое "sub-set problem" в других словарях:
sub — sub·abdominal; sub·account; sub·acetate; sub·acid; sub·acidity; sub·acute; sub·adult; sub·aerial; sub·aesthetic; sub·age; sub·agency; sub·agent; sub·akhmimic; sub·alary; sub·alate; sub·alimentation; sub·alkaline; sub·allocate; sub·almoner;… … English syllables
Set cover problem — The set covering problem is a classical question in computer science and complexity theory. As input you are given several sets. They may have some elements in common. You must select a minimum number of these sets so that the sets you have… … Wikipedia
Sub-Roman Britain — Quick Reference: History of the British Isles History of the British Isles This box … Wikipedia
Sub-internship (medicine) — A sub internship (abbreviated sub I ) is a clinical rotation of a fourth year medical student in the United States medical education system usually at a different hospital than the student s medical school affiliations. A student will generally… … Wikipedia
Dominating set — For Dominator in control flow graphs, see Dominator (graph theory). Dominating sets (red vertices). In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at… … Wikipedia
Counterfeit coin problem — Information theory was created in 1948 by Claude Shannon. This theory has notably enriched the field of research into mathematics, economics, biology, psychology, semantics, etc. As an example, this theory recently contributed to quantum… … Wikipedia
Congruence lattice problem — In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Potentially visible set — Potentially Visible Sets are used to accelerate the rendering of 3D environments. This is a form of occlusion culling, whereby a candidate set of potentially visible polygons are pre computed, then indexed at run time in order to quickly obtain… … Wikipedia
Arthropod head problem — The arthropod head problem is a long standing zoological dispute concerning the segmental composition of the heads of the various arthropod groups, and how they are evolutionarily related to each other. While the dispute has historically centered … Wikipedia
